Rainbow Matchings and Rainbow Connectedness
نویسندگان
چکیده
منابع مشابه
Rainbow Matchings and Rainbow Connectedness
Aharoni and Berger conjectured that every collection of n matchings of size n+1 in a bipartite graph contains a rainbow matching of size n. This conjecture is related to several old conjectures of Ryser, Brualdi, and Stein about transversals in Latin squares. There have been many recent partial results about the Aharoni-Berger Conjecture. The conjecture is known to hold when the matchings are m...
متن کاملRainbow matchings and connectedness of coloured graphs
Aharoni and Berger conjectured that every bipartite graph which is the union of n matchings of size n + 1 contains a rainbow matching of size n. This conjecture is a generalization of several old conjectures of Ryser, Brualdi, and Stein about transversals in Latin squares. When the matchings are all edge-disjoint and perfect, an approximate version of this conjecture follows from a theorem of H...
متن کاملRainbow matchings and transversals
We show that there exists a bipartite graph containing n matchings of sizes mi n satisfying ∑ i mi = n 2 + n/2 − 1, such that the matchings have no rainbow matching. This answers a question posed by Aharoni, Charbit and Howard. We also exhibit (n − 1) × n latin rectangles that cannot be decomposed into transversals, and some related constructions. In the process we answer a question posed by Hä...
متن کاملRainbow Matchings: existence and counting
A perfect matching M in an edge–colored complete bipartite graph Kn,n is rainbow if no pair of edges in M have the same color. We obtain asymptotic enumeration results for the number of rainbow matchings in terms of the maximum number of occurrences of a color. We also consider two natural models of random edge–colored Kn,n and show that, if the number of colors is at least n, then there is whp...
متن کاملExistences of rainbow matchings and rainbow matching covers
Let G be an edge-coloured graph. A rainbow subgraph in G is a subgraph such that its edges have distinct colours. The minimum colour degree δc(G) of G is the smallest number of distinct colours on the edges incidentwith a vertex ofG.We show that every edge-coloured graph G on n ≥ 7k/2 + 2 vertices with δc(G) ≥ k contains a rainbow matching of size at least k, which improves the previous result ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/5246